Weak Greibach Normal Form for Hyperedge Replacement Grammars
نویسندگان
چکیده
منابع مشابه
A Local Greibach Normal Form for Hyperedge Replacement Grammars
Heap-based data structures play an important role in modern programming concepts. However standard verification algorithms cannot cope with infinite state spaces as induced by these structures. A common approach to solve this problem is to apply abstraction techniques. Hyperedge replacement grammars provide a promising technique for heap abstraction as their production rules can be used to part...
متن کاملA Generalized Greibach Normal Form for Definite Clause Grammars
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for context-free grammars. The normalized definite clause grammar is declaratively equivalent to the original definite clause grammar, that is, it assigns the same analyses to the same strings. Offline-parsability of the ...
متن کاملHyperedge Replacement, Graph Grammars
In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation. In particular, hyperedge replacement graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars. To cover a large part of the theory of hyperedge replacement, structural properties and decision problems, including the membersh...
متن کاملFrom Left-Regular to Greibach Normal Form Grammars
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that is, a con text-free grammar where each right-hand side of a prorfuction begins with a terminal symbol and the remainder of the right-hand side consists of nonterminal symbols. In this short paper we show that for a left-regular grammar G we can obtain a right-regular grammar G’ (which is by defi...
متن کاملCooperating Distributed Hyperedge Replacement Grammars
The concept of cooperation and distribution as known from the area of grammar systems is introduced to graph grammars; more precisely, to hyperedge replacement (for short, HR) grammars. This can be seen as a modest approach to controlled HR. Two diierent derivation modes are considered, the so called t-mode and the =k-mode. For the t-mode it is shown that the class of hypergraph languages obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2020
ISSN: 2075-2180
DOI: 10.4204/eptcs.330.7